Yield-languages recognized by alternating tree recognizers
نویسندگان
چکیده
منابع مشابه
Spi Cellular Automata as Languages Recognizers Cellular Automata as Languages Recognizers
Language recognition is a powerful tool to evaluate the computational power of devices. In case of cellular automata, a speciic problematics appears in the one dimensional case where the space is bounded. A state of the art is presented. In the two dimensional case, few results are known. The main diiculty is to inject an order on a plane of cells. R esum e Reconna^ tre des languages est un out...
متن کاملRectangular Algebras as Tree Recognizers
We consider finite rectangular algebras of finite type as tree recognizers. The type is represented by a ranked alphabet Σ. We determine the varieties of finite rectangular Σ-algebras and show that they form a Boolean lattice in which the atoms are minimal varieties of finite Σ-algebras consisting of projection algebras. We also describe the corresponding varieties of Σ-tree languages and compa...
متن کاملLanguages recognized by nondeterministic quantum finite automata
The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model has been shown to be strictly superior in terms of language recognition power to its probabilistic counterpart. We give a characterization of the class of languages recognized by NQFA's, demonstrating that it is equal to the class of exclusive stochastic languages. We...
متن کاملLanguages Recognized by Finite Supersoluble Groups
In this paper, we give two descriptions of the languages recognized by finite supersoluble groups. We first show that such a language belongs to the Boolean algebra generated by the modular products of elementary commutative languages. An elementary commutative language is defined by a condition specifying the number of occurrences of each letter in its words, modulo some fixed integer. Our sec...
متن کاملUnary Languages Recognized by Two-Way One-Counter Automata
A two-way deterministic finite state automaton with one counter (2D1CA) is a fundamental computational model that has been examined in many different aspects since sixties, but we know little about its power in the case of unary languages. Up to our knowledge, the only known unary nonregular languages recognized by 2D1CAs are those formed by strings having exponential length, where the exponent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1988
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1988220303191